#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e7+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL dp[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   memset(dp,0x3f,sizeof(dp));
   dp[0]=0;
   LL n,x,y;cin>>n>>x>>y;
   for(LL i=1;i<=n;i++){
       if(i%2==0){
          dp[i]=min(dp[i-1]+x,dp[i/2]+y);
       }
       else if(i&1){
          dp[i]=min(dp[i-1]+x,dp[(i+1)/2]+y+x);
       }
   }
   cout<<dp[n]<<"\n";
   return 0;
}
